Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2007, Vol. 30 ›› Issue (5): 41-45.doi: 10.13190/jbupt.200705.41.354

• Papers • Previous Articles     Next Articles

MPCC: Optimal Congestion Control for Multipath Routing in Ad Hoc Networks

XU Wei-qiang1,2, WANG Ya-ming1, BAO Xiao-an1, CHEN Ji-ming2+   

  1. (1. College of Informatics and Electronics, Zhejiang Sci-Tech University, Hangzhou 310018, China;
    2. College of Information Science and Engineering, Zhejiang University, Hangzhou 310027, China)
  • Received:2006-11-06 Revised:2006-12-28 Online:2007-10-30 Published:2007-10-30
  • Contact: XU Wei-qiang

Abstract:

Based on the inherent characteristic of the contention relationship between flows in Ad hoc networks, a notion of the link’s interference set is introduced , it extends the multipath utility maximization formulating the congestion control problem for multipath routing in Internet to that in Ad hoc networks. As the objective function is not strictly concave in the path rate, the penalty function method is applied to transform the primal problem into a new formulation to obtain the optimal solution based on the subgradient method. And the multiPath congestion control algorithm (MPCC) is also proposed. It can be implemented in a parallel fashion at each source/link. Simulation results show that MPCC can quickly quickly converge to globally optimal solutions; and, compared to the additive-increase-multiplicative-decrease (AIMD) algorithm in TCP-Reno, MPCC is more adaptive to time-varying network situations, and achieves better network performance. And thus it can be used to the practical Ad hoc networks.

Key words: Ad hoc networks, congestion control, multipath routing, penalty function, subgradient

CLC Number: